Safe dike heights at minimal costs: An integer programming approach
نویسندگان
چکیده
منابع مشابه
Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case
Dike height optimization is of major importance to the Netherlands as a large part of the country lies below sea level and high water levels in rivers can cause floods. A cost-benefit analysis is discussed in Eijgenraam et al. (2010), which is an improvement of the model Van Dantzig (1956) introduced after a devastating flood in the Netherlands in 1953. We consider the extension of this model t...
متن کاملMinimal Forecast Horizons: An Integer Programming Approach
The concept of a forecast horizon has been widely studied in the operations management/research literature in the context of evaluating the impact of future data on current decisions in a multi-period decision making environment. As a solution approach for computing forecast horizons, integer programming has been largely ignored by the research community. However, the modelling and structural a...
متن کاملComputing Minimal Forecast Horizons: An Integer Programming Approach
In this paper, we use integer programming (IP) to compute minimal forecast horizons for the classical dynamic lot-sizing problem (DLS). As a solution approach for computing forecast horizons, integer programming has been largely ignored by the research community. It is our belief that the modelling and structural advantages of the IP approach coupled with the recent significant developments in ...
متن کاملAn integer linear programming approach for bilinear integer programming
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear IP. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems.
متن کاملColored Nonograms: An Integer Linear Programming Approach
In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black and white nonograms only, thus providing a universal solution for solving nonograms using ILP. Additionally we apply a known algorithm to find all solutions to a puzzle. This algorithm uses a binary cut to exclude already known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2018
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.03.012